Bottleneck Congestion and Modal Split Revisited

Congestion games revisited

Strategic games are considered where the players derive their utilities from participation in certain “processes.” Two subclasses consisting exclusively of potential games are singled out. In the first, players choose where to participate, but there is a unique way of participation, the same for all players. In the second, the participation structure is fixed, but each player may have an arbitr...

Multipath Congestion Control for Shared Bottleneck

Multipath transport protocols, which transmit data over multiple distinct paths in an end-to-end connection are introduced. However, they have a problem in terms of fairness. When the transmissions along several paths share the same bottleneck link, the multipath connection receives higher throughput than a competing regular TCP flow, because it executes congestion control per path with the sam...

Step Tolling with Bottleneck Queuing Congestion

In most dynamic traffic congestion models, congestion tolls must vary continuously over time to achieve the full optimum. This is also the case in Vickrey's (1969) ‘bottleneck model’. To date, the closest approximations of this ideal in practice have so-called ‘step tolls’, in which the toll takes on different values over discrete time intervals, but is constant within each interval. Given the ...

The Split Brain Revisited

Modal Semirings Revisited

A new axiomatisation for domain and codomain on semirings and Kleene algebras is proposed. It is much simpler, more general and more flexible than a predecessor, and it is particularly suitable for program analysis and program construction via automated deduction. Different algebras of domain elements for distributive lattices, (co-)Heyting algebras and Boolean algebras arise by adapting this a...